On randomly 3-axial graphs
نویسندگان
چکیده
منابع مشابه
On Randomly 3-axial Graphs
A graph G , every vertex of which has degree at least three, is randomly 3-axial if for each vertex V of G , any ordered collection of three paths in G of length one with initial vertex V can be cyclically randomly extended to produce three internally disjoint paths which contain all the vertices of G . Randomly 3-axial graphs of order p > k are characterized for p ^ 1 (mod 3) , and are shown t...
متن کاملOn Randomly Pk-Decomposable Graphs
A graph G is ramdomly H–decomposable if every family of edge disjoint subgraphs of G, each subgraph isomorphic to H , can be extended to an H–decomposition of G. Let Pk denote a path of length k. In this paper we characterize all ramdomly P3– decomposable graphs and ramdomly P4–decomposable graphs. We also characterize all ramdomly Pk–decomposable graphs of size 2k where all vertices have even ...
متن کاملOn randomly k-dimensional graphs
For an ordered set W = {w1, w2, . . . , wk} of vertices and a vertex v in a connected graph G, the ordered k-vector r(v|W ) := (d(v,w1), d(v,w2), . . . , d(v,wk)) is called the (metric) representation of v with respect to W , where d(x, y) is the distance between the vertices x and y. The set W is called a resolving set for G if distinct vertices of G have distinct representations with respect ...
متن کاملOn randomly colouring locally sparse graphs
We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v ∈ V the average degree of the subgraph Hv induced by the neighbours of v ∈ V is ∆ where ∆ is the maximum degree and ∆ > c1 ln n then for sufficiently large c1, this chain mixes rapidly provided q/∆ > α, where α ≈ 1.763 is the root of α = e. F...
متن کاملA Note on Randomly Regular Graphs
The graph G is said to be a randomly H graph if and only if any subgraph of G without isolated vertices, which is isomorphic to a subgraph of H, can be extended to a subgraph F of G such that F is isomorphic to H. In this paper the problem about randomly H graphs is discussed, where H is a connected regular graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1982
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700005207